package com.eistert.java.algorithm.prim;

/**
 * @Description:
 * @Author: ai
 * @create: 2023-04-27 10:42
 */
public class MGraph {
    // 表示图的节点个数
    int verxs;
    // 存放结点数据
    char[] data;
    // 存放边，就是我们的领接矩阵
    int[][] weight;

    public MGraph(int verxs) {
        this.verxs = verxs;

        this.data = new char[verxs];

        this.weight = new int[verxs][verxs];
    }
}
